The probabilistic and reliable connected power dominating set problems
نویسندگان
چکیده
منابع مشابه
On Approximability of the Independent/Connected Edge Dominating Set Problems
We investigate polynomial-time approximability of the problems related to edge dominating sets of graphs. When edges are unit-weighted, the edge dominating set problem is polynomially equivalent to the minimum maximal matching problem, in either exact or approximate computation, and the former problem was recently found to be approximable within a factor of 2 even with arbitrary weights. It wil...
متن کاملMinimum Total Communication Power Connected Dominating Set in Wireless Networks
A virtual backbone of a wireless network is a connected subset of nodes responsible for routing messages in the network. A node in the subset is likely to be exhausted much faster than the others due to its heavy duties. This situation can be more aggravated if the node uses higher communication power to form the virtual backbone. In this paper, we introduce the minimum total communication powe...
متن کاملImproved approximation algorithms for k-connected m-dominating set problems
A graph is k-connected if it has k internally-disjoint paths between every pair of nodes. A subset S of nodes in a graph G is a kconnected set if the subgraph G[S] induced by S is k-connected; S is an m-dominating set if every v ∈ V \ S has at least m neighbors in S. If S is both k-connected and m-dominating then S is a k-connected m-dominating set, or (k,m)-cds for short. In the k-Connected mD...
متن کاملOn connected dominating set games †
Many authors studied cooperative games that arise from variants of dominating set games on graphs. In wireless networks, the connected dominating set is used to reduce routing table size and communication cost. In this paper, we introduce a connected dominating set game to model the cost allocation problem arising from a connected dominating set on a given graph and study its core. In addition,...
متن کاملConstructing Minimum Connected Dominating Set: Algorithmic approach
Connected Dominating Set is popularly used for constructing virtual backbones for broadcasting operation in WSNs. UD Graph is the most suitable model for a wireless sensor network. In this paper we provide an algorithm to find MCDS in UD Graph. It is based on the computation of convex hulls of sensor nodes or vertices. Constructing a virtual backbone in WSNs is an important issue because it red...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2018
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-018-1339-6